منابع مشابه
Presenting a Method of Scheduling the Access to Data Relating to V-I in VANET
Today, vehicular Ad-hoc Network between automobiles has been accepted by the public, and many people are interested in exchanging information with other vehicles as well as with roadside equipment while driving. When a number of vehicles want to access to the data stored in RSU ,the priority of servicing comes into face .In this case, some methods, such as D*S, D*S/N, have been presented ...
متن کاملHard Thresholding Pursuit Algorithms: Number of Iterations
The Hard Thresholding Pursuit algorithm for sparse recovery is revisited using a new theoretical analysis. The main result states that all sparse vectors can be exactly recovered from compressive linear measurements in a number of iterations at most proportional to the sparsity level as soon as the measurement matrix obeys a certain restricted isometry condition. The recovery is also robust to ...
متن کاملPerimeter Clustering Algorithm to Reduce the Number of Iterations
Clustering is a division of data into groups of similar objects. Clustering is an unsupervised learning, due to its unknown label class in the search domain. K-means is one of the simplest unsupervised learning algorithms that solve the well known clustering problem. It has capability to cluster large data. The main idea of K-Means is to define k centroids for each cluster. The K-means algorith...
متن کاملPresenting a Method of Scheduling the Access to Data Relating to V-I in VANET
Today, vehicular Ad-hoc Network between automobiles has been accepted by the public, and many people are interested in exchanging information with other vehicles as well as with roadside equipment while driving. When a number of vehicles want to access to the data stored in RSU ,the priority of servicing comes into face .In this case, some methods, such as D*S, D*S/N, have been presented ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Parallel Computing
سال: 2018
ISSN: 2329-4949,2329-4957
DOI: 10.1145/3154855